Error Floor Analysis of LDPC Column Layered Decoders

نویسندگان

چکیده

In this letter, we analyze the error floor of column layered decoders, also known as shuffled for low-density parity-check (LDPC) codes under saturating sum-product algorithm (SPA). To estimate floor, evaluate failure rate different trapping sets (TSs) that contribute to frame in region. For each such TS, model dynamics SPA vicinity TS by a linear state-space incorporates information message-passing schedule. Consequently, parameters and change result order which messages layers are updated. This, turn, causes code function scheduling. Based on proposed analysis, then devise an efficient search find schedule minimizes floor. Simulation results presented verify accuracy estimation technique.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Design of LDPC Decoders for Low Error Rate Performance

Many classes of high-performance low-density parity-check (LDPC) codes are based on parity check matrices composed of permutation submatrices. We describe the design of a parallel-serial decoder architecture that can be used to map any LDPC code with such structure to a hardware emulation platform. High-throughput emulation allows for the exploration of the low bit error rate (BER) region and p...

متن کامل

High-throughput LDPC decoders

A high-throughput memory-efficient decoder architecture for low-density parity-check (LDPC) codes is proposed based on a novel turbo decoding algorithm. The architecture benefits from various optimizations performed at three levels of abstraction in system design—namely LDPC code design, decoding algorithm, and decoder architecture. First, the interconnect complexity problem of current decoder ...

متن کامل

Reduced-complexity column-layered decoding and implementation for LDPC codes

Layered decoding is well appreciated in Low-Density Parity-Check (LDPC) decoder implementation since it can achieve effectively high decoding throughput with low computation complexity. This work, for the first time, addresses low complexity column-layered decoding schemes and VLSI architectures for multi-Gb/s applications. At first, the Min-Sum algorithm is incorporated into the column-layered...

متن کامل

Two Methods for Reducing the Error-Floor of LDPC Codes

We investigate two techniques for reducing the error-floor of low-density parity-check codes under iterative decoding. Both techniques are developed based on comprehensive analytical and simulation studies of combinatorial properties of trapping sets in codes on graphs. The first technique represents an algorithmic modification of beliefpropagation based on data fusion principles and specialize...

متن کامل

The error-floor of LDPC codes in the Laplacian channel

We analyze the performance of Low-Density-Parity-Check codes in the error-floor domain where the Signal-to-Noise-Ratio, s, is large, s 1. We describe how the instanton method of theoretical physics, recently adapted to coding theory, solves the problem of characterizing the error-floor domain in the Laplacian channel. An example of the (155;64;20) LDPC code with four iterations (each iteration ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Communications Letters

سال: 2022

ISSN: ['1558-2558', '1089-7798', '2373-7891']

DOI: https://doi.org/10.1109/lcomm.2021.3137203